Approximate convex hull of affine iterated function system attractors
نویسندگان
چکیده
منابع مشابه
Approximate convex hull of affine iterated function system attractors
In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in...
متن کاملOn Constructing Approximate Convex Hull
The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n+ k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications prefe...
متن کاملAttractors of Iterated Function Systems
In this paper, the question of which compact metric spaces can be attractors of hyperbolic iterated function systems on Euclidean space is studied. It is shown that given any finite-dimensional compact metric X , there is a Cantor set C such that the disjoint union of C and X is an attractor. In the process, it is proved that every such X is the Lipschitz image of a Cantor set.
متن کاملApproximate Convex Hull of Data Streams
Given a finite set of points P ⊆ R, we would like to find a small subset S ⊆ P such that the convex hull of S approximately contains P . More formally, every point in P is within distance from the convex hull of S. Such a subset S is called an -hull. Computing an -hull is an important problem in computational geometry, machine learning, and approximation algorithms. In many real world applicati...
متن کاملOn bounding boxes of iterated function system attractors
Before rendering 2D or 3D fractals with iterated function systems, it is necessary to calculate the bounding extent of fractals. We develop a new algorithm to compute the bounding box which closely contains the entire attractor of an iterated function system. r 2003 Elsevier Science Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2012
ISSN: 0960-0779
DOI: 10.1016/j.chaos.2012.07.015